Chaudhuri Scribe : Aaron Sterling 1 Introduction
نویسنده
چکیده
The main objective of this lecture is to prove a lower bound on the number of registers (variables) required for any distributed algorithm that solves the Mutual Exclusion problem. We will work in an asynchronous shared memory model. Recall that Peterson’s Algorithm on n processors solves Mutual Exclusion by using two arrays, each of size n. So 2n is an upper bound on the number of registers needed to solve ME. In these notes, we will derive a lower bound of n.
منابع مشابه
Discrete Algorithms for Mobile and Wireless Networks Lecture 12 : Thursday , 22 nd February 2007 Instructor : Soma Chaudhuri Scribe : Aaron Sterling
This class period focused on a theoretical application of collision-detectors to solve the consensus problem; and the implementation of replicated state machines, to produce fault-tolerant wireless networks. We reviewed two papers: “Consensus and Collision Detectors in Wireless Ad Hoc Networks” by G. Chockler, M. Demirbas and S. Gilbert; and “Replicated State Machines” by G. Chockler and S. Gil...
متن کامل2007 Instructor : Soma Chaudhuri Scribe : Puviyarasan Pandian
In the last lecture, we discussed Reference Broadcast Synchronization, a mechanism which addresses the problem of energy-frugal μ-second precision time synchronization. The method involved synchronization between receivers based on the arrival time of a reference broadcast. The algorithm was extended to work on multiple domains as well, where nodes not in the same broadcast domain achieve this ...
متن کاملThe role of Baghdad scribe women in developing Islamic sciences and culture in the fourth era of the Abbasid Caliphate (448-656 AH)
Scribe women in the Abbasid era were active in various political, social, and cultural fields. Analyzing Iraq scribe women, specifically Baghdad, in the fourth era of the Abbasid caliphate (448-656 AH), the present study seeks to answer the question of what was their roles in cultural changes and the development of Islamic sciences and culture. This study has used a historical research method b...
متن کاملPropositional Proof Complexity An Introduction
1 Preface and Acknowledgements This article is an abridged and revised version of a 1996 McGill University technical report [14]. The technical report was based on lectures delivered by the author at a workshop in Holetown, Barbados and on the authors prepared overhead transparencies. The audience at this workshop wrote scribe notes which then formed the technical report [14]. The material sele...
متن کاملSoma Chaudhuri Scribe : Abhishek Sinha
The lecture can be divided into two parts. The first part of the lecture is based on: A perspective on Multi-Access Channels by Robert G. Gallager. The paper is GALLAGER, R. A Perspective on Multi-Access Channels. IEEE Transactions on Information Theory, 31(2):124-142, 1985. The second part of the lecture is based on: An Asymptotically Nonadaptive Algorithm for Conflict Resolution in Multiple-A...
متن کامل